Graphs with maximum degree 5 are acyclically 1 7 - colorable ∗ 2 Alexandr
نویسندگان
چکیده
9 An acyclic coloring is a proper coloring with the additional property that the union of 10 any two color classes induces a forest. We show that every graph with maximum degree at 11 most 5 has an acyclic 7-coloring. We also show that every graph with maximum degree at 12 most r has an acyclic (1 + b (r+1) 2 4 c)-coloring. 13
منابع مشابه
On 11-improper 22-coloring of sparse graphs
A graph G is (1, 1)-colorable if its vertices can be partitioned into subsets V1 and V2 so that every vertex in G[Vi] has degree at most 1 for each i ∈ {1, 2}. We prove that every graph with maximum average degree at most 14 5 is (1, 1)-colorable. In particular, it follows that every planar graph with girth at least 7 is (1, 1)-colorable. On the other hand, we construct graphs with maximum aver...
متن کاملAcyclic edge coloring of subcubic graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using 5 colors. This result is tight since there are...
متن کاملAcyclic Choosability of Graphs with Small Maximum Degree
A proper vertex coloring of a graph G = (V, E) is acyclic if G contains no bicolored cycle. A graph G is L-list colorable if for a given list assignment L = {L(v) : v ∈ V }, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V . If G is L-list colorable for every list assignment with |L(v)| ≥ k for all v ∈ V , then G is said k-choosable. A graph is said to be acyclically k-...
متن کاملGraphs with maximum degree 6 are acyclically 11-colorable
An acyclic k-coloring of a graph G is a proper vertex coloring of G, which uses at most k colors, such that the graph induced by the union of every two color classes is a forest. In this note, we prove that every graph with maximum degree six is acyclically 11-colorable, thus improving the main result of [12].
متن کاملDefective 2-colorings of sparse graphs
A graph G is (j, k)-colorable if its vertices can be partitioned into subsets V1 and V2 such that in G[V1] every vertex has degree at most j and in G[V2] every vertex has degree at most k. We prove that if k ≥ 2j + 2, then every graph with maximum average degree at most 2 ( 2− k+2 (j+2)(k+1) ) is (j, k)colorable. On the other hand, we construct graphs with the maximum average degree arbitrarily...
متن کامل